The virtual fibering theorem for 3-manifolds

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Criteria for Virtual Fibering

We prove that an irreducible 3-manifold whose fundamental group satisfies a certain group-theoretic property called RFRS is virtually fibered. As a corollary, we show that 3-dimensional reflection orbifolds and arithmetic hyperbolic orbifolds defined by a quadratic form virtually fiber. These include the Seifert Weber dodecahedral space and the Bianchi groups. Moreover, we show that a taut sutu...

متن کامل

A New Decomposition Theorem for 3-Manifolds

Introduction We develop in this paper a theory of complexity for pairs (M,X) where M is a compact 3-manifold such that χ(M) = 0, and X is a collection of trivalent graphs, each graph τ being embedded in one component C of ∂M so that C \ τ is one disc. In the special case where M is closed, so X = ∅, our complexity coincides with Matveev’s [6]. Extending his results we show that complexity of pa...

متن کامل

A finiteness theorem for hyperbolic 3-manifolds

We prove that there are only finitely many closed hyperbolic 3-manifolds with injectivity radius and first eigenvalue of the Laplacian bounded below whose fundamental groups can be generated by a given number of elements.

متن کامل

Markov's theorem in 3{manifolds

Sofia Lambropoulou and Colin Rourke Abstract In this paper we rst give a one-move version of Markov's braid theorem for knot isotopy in S3 that sharpens the classical theorem. Then a relative version of Markov's theorem concerning a xed braided portion in the knot. We also prove an analogue of Markov's theorem for knot isotopy in knot complements. Finally we extend this last result to prove a M...

متن کامل

The rank of the fundamental group of certain hyperbolic 3–manifolds fibering over the circle

Probably the most basic invariant of a finitely generated group is its rank, ie the minimal number of elements needed to generate it. In general the rank of a group is not computable. For instance, there are examples, due to Baumslag, Miller and Short [3], of hyperbolics groups showing that there is no uniform algorithm solving the rank problem. Everything changes in the setting of 3–manifold g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: L’Enseignement Mathématique

سال: 2014

ISSN: 0013-8584

DOI: 10.4171/lem/60-1/2-5